Tree Kernel Usage in Naive Bayes Classifiers
نویسنده
چکیده
We present a novel approach in machine learning by combining naı̈ve Bayes classifiers with tree kernels. Tree kernel methods produce promising results in machine learning tasks containing treestructured attribute values. These kernel methods are used to compare two tree-structured attribute values recursively. Up to now tree kernels are only used in kernel machines like Support Vector Machines or Perceptrons. In this paper, we show that tree kernels can be utilized in a naı̈ve Bayes classifier enabling the classifier to handle tree-structured values. We evaluate our approach on three datasets containing tree-structured values. We show that our approach using tree-structures delivers significantly better results in contrast to approaches using non-structured (flat) features extracted from the tree. Additionally, we show that our approach is significantly faster than comparable kernel machines in several settings which makes it more useful in resource-aware settings like mobile devices. Naı̈ve Bayes Classifier; Tree Kernel; Lazy Learning; Tree-structured Values
منابع مشابه
Bagging classifiers based on Kernel density estimators
A lot of research is being conducted on combining classification rules (classifiers) to produce a single one, known as an ensemble, which in general is more accurate than the individual classifiers making up the ensemble. Two popular methods for creating ensembles are Bagging introduced by Breiman, (1996) and, AdaBoosting by Freund and Schapire (1996). These methods rely on resampling technique...
متن کاملTransductive Reliability Estimation for Kernel Based Classifiers
Estimating the reliability of individual classifications is very important in several applications such as medical diagnosis. Recently, the transductive approach to reliability estimation has been proved to be very efficient when used with several machine learning classifiers, such as Naive Bayes and decision trees. However, the efficiency of the transductive approach for state-of-the art kerne...
متن کاملInt Reduction
Naive-Bayes induction algorithms were previously shown to be surprisingly accurate on many classification tasks even when the conditional independence assumption on which they are based is violated. However, most studies were done on small databases. We show that in some larger databases, the accuracy of Naive-Bayes does not scale up as well as decision trees. We then propose a new algorithm, N...
متن کاملLearning the Tree Augmented Naive Bayes Classifier from incomplete datasets
The Bayesian network formalism is becoming increasingly popular in many areas such as decision aid or diagnosis, in particular thanks to its inference capabilities, even when data are incomplete. For classification tasks, Naive Bayes and Augmented Naive Bayes classifiers have shown excellent performances. Learning a Naive Bayes classifier from incomplete datasets is not difficult as only parame...
متن کاملEvaluation of SVM Kernels and Conventional Machine Learning Algorithms for Speaker Identification
One of the central problems in the study of Support vector machine (SVM) is kernel selection, that’s based essentially on the problem of choosing a kernel function for a particular task and dataset. By contradiction to other machine learning algorithms, SVM focuses on maximizing the generalisation ability, which depends on the empirical risk and the complexity of the machine. In the following p...
متن کامل